Redundant disequalities in the Latin Square problem
نویسندگان
چکیده
منابع مشابه
Gossip Latin Square and The Meet-All Gossipers Problem
Given a network of n = 2 gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper communicates (gossips) only once a day, with one other gossiper, (2) in every (n−1) consecutive days, each gossiper meets all other gossipers, and (3) every gossip, initiated by any gossiper, will reach all gossipers within k = log(n) days. In this paper we stu...
متن کاملAn Efficient Local Search for Partial Latin Square Extension Problem
A partial Latin square (PLS) is a partial assignment of n symbols to an n×n grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood...
متن کاملRandom Latin square graphs
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and seve...
متن کاملLatin Squares and Redundant Inequalities
A complete classification of redundant sets of inequalities in the specification of the Latin Square problem of size N is proven. Related issues on variations of the same problem are discussed.
متن کاملRank 3 Latin square designs
A Latin square design whose automorphism group is transitive of rank at most 3 on points must come from the multiplication table of an elementary abelian p-group,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2013
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-013-9147-1